Validated Computation of Heteroclinic Sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validated Computation of Heteroclinic Sets

In this work we develop a method for computing mathematically rigorous enclosures of some one dimensional manifolds of heteroclinic orbits for nonlinear maps. Our method exploits a rigorous curve following argument build on high order Taylor approximation of the local stable/unstable manifolds. The curve following argument is a uniform interval Newton method applied on short line segments. The ...

متن کامل

Automatic Generation of Validated Specific Epitope Sets

Accurate measurement of B and T cell responses is a valuable tool to study autoimmunity, allergies, immunity to pathogens, and host-pathogen interactions and assist in the design and evaluation of T cell vaccines and immunotherapies. In this context, it is desirable to elucidate a method to select validated reference sets of epitopes to allow detection of T and B cells. However, the ever-growin...

متن کامل

Construction of Lyapunov functions by validated computation

We provide a systematic method to validate the domain of Lyapunov functions around hyperbolic fixed points both for continuous and for discrete dynamical systems with computer assistance. We also give the construction of Lyapunov functions around periodic orbits as fixed points of Poincaré maps as well as validation examples in our talk.

متن کامل

CAD Adjacency Computation Using Validated Numerics

We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and topological properties e.g. homology groups. Other applications include visualization and path planning. Our algorithm determines cell adjacency information using...

متن کامل

Implementing Sets for Reversible Computation

Sets provide a very general tool for representing information and modelling the behaviour of systems. We consider their implementation and associated problems of garbage collection in the context of reversible computation. We describe our implementation technique, which uses ordered arrays, and discuss scalability of performance.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Applied Dynamical Systems

سال: 2017

ISSN: 1536-0040

DOI: 10.1137/16m1060674